Efficient Time Series Clustering by Minimizing Dynamic Time Warping Utilization

نویسندگان

چکیده

Dynamic Time Warping (DTW) is a widely used distance measurement in time series clustering. DTW invariant to phase perturbations but has quadratic complexity. An effective acceleration method must reduce the utilization ratio during clustering; for example, TADPole uses both upper and lower bounds prune off large of expensive calculations. To further ratio, we find that linear-complexity L1-norm (Manhattan distance) enough when only comprise small perturbations. Therefore, propose novel clustering by Minimizing Utilization (MiniDTW) algorithm accelerate In MiniDTW, dataset first greedily summarized into seed clusters, which perturbations, distance. Then, develop new Sparse Symmetric Non-negative Matrix Factorization (SSNMF) algorithm, factorizes matrix cluster centers, merge clusters final clusters. The experiments on UCR datasets demonstrate pruning 98.52% utilization, better than counterpart method, TADPole, prunes 75.56% utilization; thus MiniDTW 10 times faster TADPole.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Time Warping Techniques in Clustering Time Series

The problem of obtaining an accurate forecast is becoming more and more significant as the production possibilities and technologies evolve. The accuracy of a forecast mainly depends on the dataset used for forecasting as well as on the methods employed. This study is devoted to the time series analysis. A set of known methods and techniques are used for analysing the time series; one of them i...

متن کامل

A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets

Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and domains. After more than a decade of extensive efforts, there is increasing evidence that Dynamic Time Warping (DTW) is very difficult to beat. Given that, recent efforts have focused on making the intrinsically slow DTW ...

متن کامل

Towards more accurate clustering method by using dynamic time warping

An intrinsic problem of classifiers based on machine learning (ML) methods is that their learning time grows as the size and complexity of the training dataset increases. For this reason, it is important to have efficient computational methods and algorithms that can be applied on large datasets, such that it is still possible to complete the machine learning tasks in reasonable time. In this c...

متن کامل

Iterative Deepening Dynamic Time Warping for Time Series

Time series are a ubiquitous form of data occurring in virtually every scientific discipline and business application. There has been much recent work on adapting data mining algorithms to time series databases. For example, Das et al. attempt to show how association rules can be learned from time series [7]. Debregeas and Hebrail [8] demonstrate a technique for scaling up time series clusterin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3067833